Routing Algorithm for Fastest Path – a Queuing Approach
نویسندگان
چکیده
منابع مشابه
Fastest-Path Computation
Definition In the United states, only 9.3% of the households do not have cars. Driving is part of people’s daily life. GIS systems like MapQuest and MapPoint are heavily relied on to provide driving directions. However, surprisingly enough, existing systems either ignore the driving speed on road networks, or assume the speed remains constant on the road segments. In both cases the users’ prefe...
متن کاملLeach Routing Algorithm Optimization through Imperialist Approach
Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...
متن کاملMultiple path routing algorithm for IP networks
Internet routing protocols, such as Open Shortest Path First (OSPF), compute a shortest path tree from each node to other nodes in the network, using link-state information. Such protocols do not consider the queueing situation at a given node. An alternate path of higher cost may be more convenient to use than the optimum path when a long queue is present at the node. This paper proposes a new...
متن کاملA Multi-path Hybrid Routing Algorithm in Network Routing
The shortest path tree construction is essential in network routing, and the Dijkstra algorithm, which is a static routing algorithm, is widely used. When some links in a network have new weights, dynamic routing algorithms are more efficient than static routing algorithms. This is because the dynamic routing algorithms reduce redundancy by recomputing only the affected sections of the network ...
متن کاملFastest Mixing Markov Chain on a Path
Simulation using Markov chain Monte Carlo is a mainstay of scientific computing; see, e.g., [4, 5] for pointers to the literature. Thus the analysis and design of fast mixing Markov chains, with given stationary distribution, has become a research area. In [2], we show how to numerically find the fastest mixing Markov chain (i.e., the one with smallest secondlargest eigenvalue modulus) on a giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.10.26107